Multiple Products of Polykays Using Ordered Partitions
نویسندگان
چکیده
منابع مشابه
Hereditary properties of partitions, ordered graphs and ordered hypergraphs
In this paper we use the Klazar-Marcus-Tardosmethod (see [22]) to prove that if a hereditary property of partitions P has super-exponential speed, then for every k-permutation π, P contains the partition of [2k] with parts {{i, π(i) + k} : i ∈ [k]}. We also prove a similar jump, from exponential to factorial, in the possible speeds of monotone properties of ordered graphs, and of hereditary pro...
متن کاملFragmentation of ordered partitions and intervals
Fragmentation processes of exchangeable partitions have already been studied by several authors. This paper deals with fragmentations of exchangeable compositions, i.e. partitions of N in which the order of the blocks matters. We will prove that such a fragmentation is bijectively associated to an interval fragmentation. Using this correspondence, we then study two examples : Ruelle’s interval ...
متن کاملPartitions of a Finite Partially Ordered Set
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...
متن کاملCongruences in ordered pairs of partitions
1. Introducing the birank. A partition is defined as being a nonincreasing sequence of positive integers, λ = (λ1,λ2, . . . ,λr ). The set of all partitions, which includes the empty partition ∅, is denoted by . The sum of the parts of a given partition is called the weight of the partition, wt(λ) = λ1+λ2+···+λr . It is standard notation to write (z;q)∞ := ∏ t≥0(1−zq) and p−k(n) for the coeffic...
متن کاملEuler-mahonian Statistics on Ordered Partitions
An ordered partition with k blocks of [n] := {1, 2, . . . , n} is a sequence of k disjoint and nonempty subsets, called blocks, whose union is [n]. Clearly the number of such ordered partitions is k!S(n, k), where S(n, k) is the Stirling number of the second kind. A statistic on ordered partitions of [n] with k blocks is called Euler-Mahonian statistics if its generating polynomial is [k]q!Sq(n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1973
ISSN: 0090-5364
DOI: 10.1214/aos/1176342511